Large sets of Hamilton cycle and path decompositions
نویسندگان
چکیده
منابع مشابه
Path And Cycle Decompositions
First I want to say a few words about my graph terminology. If I want to allow loops, I use the adjective reflexive. If I want to allow multiple edges, I use multigraph. Thus, a graph has no loops and no multiple edges. I use valency rather than degree. If we say a graph is 4-valent (or tetravalent), it means it is regular of valency 4, for example. A decomposition of a graph X is a partition o...
متن کاملSymmetric Hamilton cycle decompositions of complete multigraphs
Let n ≥ 3 and λ ≥ 1 be integers. Let λKn denote the complete multigraph with edge-multiplicity λ. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of λK2m for all even λ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of λK2m − F for all odd λ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki...
متن کاملTSP tour domination and Hamilton cycle decompositions of regular digraphs
In this paper, we solve a problem by Glover and Punnen (1997) from the context of domination analysis, where the performance of a heuristic algorithm is rated by the number of solutions that are not better than the solution found by the algorithm, rather than by the relative performance compared to the optimal value. In particular, we show that for the Asymmetric Traveling Salesman Problem (ATS...
متن کاملHamilton cycle decompositions of k-uniform k-partite hypergraphs
Let m ≥ 2 and k ≥ 2 be integers. We show that K k×m has a decomposition into Hamilton cycles of Kierstead-Katona type if k | m. We also show that K (3) 3×m − T has a decomposition into Hamilton cycles where T is a 1-factor if and only if 3 m and m = 4. We introduce a notion of symmetry and comment on the existence of symmetric Hamilton cycle decompositions of K (k) k×m.
متن کاملOptimal path and cycle decompositions of dense quasirandom graphs
Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let 0 < p < 1 be constant and let G ∼ Gn,p. Let odd(G) be the number of odd degree vertices in G. Then a.a.s. the following hold: (i) G can be decomposed into b∆(G)/2c cycles and a matching of size odd(G)/2. (ii) G can be decompo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.09.015